on the commutativity degree in finite moufang loops

the textit{commutativity degree}, $pr(g)$, of a finite group $g$ (i.e. the probability that two (randomly chosen) elements of $g$ commute with respect to its operation)) has been studied well by many authors. it is well-known that the best upper bound for $pr(g)$ is $frac{5}{8}$ for a finite non--abelian group $g$. in this paper, we will define the same concept for a finite non--abelian textit{moufang loop} $m$ and try to give a best upper bound for $pr(m)$. we will prove that for a well-known class of finite moufang loops, named textit{chein loops}, and its modifications, this best upper bound is $frac{23}{32}$. so, our conjecture is that for any finite moufang loop $m$, $pr(m)leq frac{23}{32}$. also, we will obtain some results related to the $pr(m)$ and ask the similar questions raised and answered in group theory about the relations between the structure of a finite group and its commutativity degree in finite moufang loops.